MISQP : A Fortran Subroutine of a Trust Region SQP Algorithm for Mixed - Integer Nonlinear Programming 1 - User ’ s Guide

نویسندگان

  • Oliver Exler
  • Thomas Lehmann
  • Klaus Schittkowski
چکیده

The Fortran subroutine MISQP solves mixed-integer nonlinear programming problems by a modified sequential quadratic programming (SQP) method. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is stabilized by a trust region method including Yuan’s second order corrections. It is not assumed that integer variables are relaxable. In other words, problem functions are evaluated only at integer points. The Hessian of the Lagrangian function is approximated by BFGS updates subject to the continuous and integer variables. The usage of the code is documented and illustrated by an example.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MISQP: A Fortran Subroutine of a Trust Region SQP Algorithm for Mixed-Integer Nonlinear Programming

The Fortran subroutine MISQP solves mixed-integer nonlinear programming problems by a modified sequential quadratic programming (SQP) method. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is sta...

متن کامل

A trust region SQP algorithm for mixed-integer nonlinear programming

We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is stabilized by a tru...

متن کامل

A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization

We present numerical results of a comparative study of codes for nonlinear and nonconvex mixed-integer optimization. The underlying algorithms are based on sequential quadratic programming (SQP) with stabilization by trust-regions, linear outer approximations, and branch-and-bound techniques. Themixed-integer quadratic programming subproblems are solved by a branch-and-cut algorithm. Second ord...

متن کامل

A Feasible Trust-Region Sequential Quadratic Programming Algorithm

An algorithm for smooth nonlinear constrained optimization problems is described, in which a sequence of feasible iterates is generated by solving a trust-region sequential quadratic programming (SQP) subproblem at each iteration, and perturbing the resulting step to retain feasibility of each iterate. By retaining feasibility, the algorithm avoids several complications of other trust-region SQ...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011